Coalition-proof Nash allocation in a barter game with multiple indivisible goods

نویسنده

  • Jun Wako
چکیده

We consider a barter market with multiple types of indivisible goods. Konishi et al. [J. Math. Econ. 35 (2001) 1–15] showed that the core of this market may be empty. We define a normal form game for this market and consider its equilibrium outcomes. Assuming separable strict preferences, we show that the game has a unique Coalition-proof Nash allocation. This Coalition-proof Nash allocation is precisely the unique commodity-wise competitive allocation of the market, and it may be inefficient. The commodity-wise competitive allocation is implementable in Coalition-proof Nash equilibria but not in Strong Nash equilibria. D 2004 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategic Behavior when Allocating Indivisible Goods

We study a simple sequential allocation mechanism for allocating indivisible goods between agents in which agents take turns to pick items. We focus on agents behaving strategically. We view the allocation procedure as a finite repeated game with perfect information. We show that with just two agents, we can compute the unique subgame perfect Nash equilibrium in linear time. With more agents, c...

متن کامل

Strategic Behavior in a Decentralized Protocol for Allocating Indivisible Goods

We study in detail a simple sequential procedure for allocating a set of indivisible goods to multiple agents. Agents take turns to pick items according to a policy. For example, in the alternating policy, agents simply alternate who picks the next item. A similar procedure has been used by Harvard Business School to allocate courses to students. We study here the impact of strategic behavior o...

متن کامل

The Relation Between Implementability and the Core

This paper proves a simple and general theorem on resource-allocation mechanisms that achieve Pareto efficiency. We say that a mechanism (game form) is normal if at any action profile, an agent who obtains his endowments neither pays nor receives a positive amount. In the context of auctions, this simply means that losers receive no bill. We prove that for any normal mechanism, if its Nash equi...

متن کامل

Coalition-proof equilibria in a voluntary participation game

We examine the coalition-proof equilibria of a participation game in a public good mechanism and study which Nash equilibria are achieved through the cooperative behavior of agents. The participation game may have multiple Nash equilibria, and various numbers of participants may be attained at the Nash equilibria. We provide sufficient conditions for the Nash equilibrium of the participation ga...

متن کامل

An efficient multi-item dynamic auction with budget constrained bidders

An auctioneer wishes to sell several heterogeneous indivisible items to a group of potential bidders. Each bidder has valuations over the items but may face a budget constraint and therefore be unable to pay up to his values. In such markets, a Walrasian equilibrium may fail to exist. We develop a novel dynamic auction and prove that the auction always finds a core allocation. In the auction pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2005